翻訳と辞書
Words near each other
・ Algeria at the 2013 UCI Road World Championships
・ Algeria at the 2013 World Aquatics Championships
・ Algeria at the 2013 World Championships in Athletics
・ Algeria at the 2014 FEI World Equestrian Games
・ Algeria at the 2014 Summer Youth Olympics
・ Algeria at the 2014 UCI Road World Championships
・ Algeria at the 2015 African Games
・ Algeria at the 2015 Summer Universiade
・ Algeria at the 2015 UCI Road World Championships
・ Algebraic independence
・ Algebraic integer
・ Algebraic interior
・ Algebraic K-theory
・ Algebraic link
・ Algebraic logic
Algebraic Logic Functional programming language
・ Algebraic manifold
・ Algebraic matroid
・ Algebraic modeling language
・ Algebraic normal form
・ Algebraic notation
・ Algebraic notation (chess)
・ Algebraic number
・ Algebraic number field
・ Algebraic number theory
・ Algebraic operation
・ Algebraic Petri net
・ Algebraic Reconstruction Technique
・ Algebraic Riccati equation
・ Algebraic semantics


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Algebraic Logic Functional programming language : ウィキペディア英語版
Algebraic Logic Functional programming language
:''ALF can also refer to ALF (theorem prover).''
Algebraic Logic Functional programming language also known as ALF is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming.
ALF was designed to be genuine integration of both programming paradigms, and thus any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF's operational semantics is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. In order to reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which, it is claimed, can be efficiently implemented. Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top. Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than Prolog's resolution strategy. Similarly to Prolog, ALF uses a backtracking strategy corresponding to a depth-first search in the derivation tree.
The ALF system was designed to be an efficient implementation of the combination of resolution, narrowing, rewriting, and rejection. ALF programs are compiled into instructions of an abstract machine. The abstract machine is based on the Warren Abstract Machine (WAM) with several extensions to implement narrowing and rewriting. In the current ALF implementation programs of this abstract machine are executed by an emulator written in C.
In the Carnegie Mellon University Artificial Intelligence Repository,〔 〕 ALF is included as an AI programming language, in particular as a functional/logic programming language Prolog implementation.〔 〕 A user manual〔 〕 describing the language and the use of the system is available. The ALF System〔 〕 runs under Unix and is free.
==References==



抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Algebraic Logic Functional programming language」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.